Method and network entity for logical channel management in a wireless communication network

ABSTRACT

The method includes receiving, by a network entity, a plurality of data packets to be prioritized belonging to a Data Radio Bearer (DRB) from a network to a User Equipment (UE) using a plurality of logical channels and configuring a Quality of Service (QoS) parameter of the plurality of logical channels. Further, the method includes allocating, by the network entity, the configured QoS parameter to the DRB, logical channel, a Logical Channel Group (LCG), and a DRB buffer or queue. Further, the method includes dividing, by the network entity, the QoS parameter across one of the DRB, the logical channel, the LCG, and a DRB buffer or queue and sending, by the network entity, the plurality of data packets to the UE by allocating at least one resource as per the PBR and the BSD.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No.PCT/KR2021/012334 designating the United States, filed on Sep. 10, 2021,in the Korean Intellectual Property Receiving Office and claimingpriority to Indian Provisional Patent Application No. 202041039454,filed on Sep. 11, 2020 in the Indian Patent Office and IndianNon-Provisional Patent Application No. 202041039454, filed on Sep. 6,2021, in the Indian Patent Office, the disclosures of which areincorporated by reference herein in their entireties.

BACKGROUND Field

The disclosure relates to a wireless communication network. For example,the disclosure relates to method and network entity for logical channelmanagement in the wireless network.

Description of Related Art

In general, several broadband wireless technologies have been developedin recent years to provide enhanced applications and services to meetrising needs of broadband users. A Second Generation (2G) wirelesscommunication system has been created to deliver voice services whileensuring mobility of the users. A Third-Generation (3G) wirelesscommunication system provides both voice and data services. AFourth-Generation (4G) wireless communication system has been developedin recent years to provide high-speed data delivery. However, thefourth-generation wireless communication system still lacks resourcesneeded to fulfill the rising needs for high-speed data services. Thisproblem is addressed by deployment of a Fifth-Generation (5G) wirelesscommunication system to meet the rising needs for high-speed dataservices. Furthermore, the fifth-generation wireless communicationsystem provides ultra-reliability and supports low latency applications.

For the next generation of the wireless communication system (e.g. 6G),various technologies have been considered, such as Visible LightCommunication (VLC), Terahertz (THz) band e.g., frequencies from 100 GHzto 3 THz, Infrared wave, and Ultraviolet wave. Among all thesetechnologies, the THz band is envisioned as a potential technology for abroad variety of applications at Nano/Micro/Macro sizes. The THz bandhas several advantages, including an ability to offer Terabits persecond (Tbps) data speeds, reliable transmission, and low latency.Because of a large variety of unused and undiscovered spectrum,frequencies ranging from 100 GHz to 3 THz are potential bands for thenext generation of wireless communication systems. The THz band has thepotential for revolutionary applications in the realms of devices,circuits, software, signal processing, and systems. Further, the THzband/mm Wave's cellular networks provide ultra-high data rates forsuper-fast download speeds for computer communication, autonomousvehicles, robotic controls, information shower, high-definitionholographic gaming, entertainment, video conferencing, and high-speedwireless data distribution in data centers.

Extremely high data rates provide promising applications for futuremmWaves and THz bands, which are expected to emerge in 6G networks andbeyond. The extremely high data rates/peak data rate in the Gigabits persecond (Gbps) range is conceivable with the THz bands and high mmWaves.Furthermore, the peak data rate throughput may potentially exceed 100Gbps in future wireless communication systems/beyond 5G. Furthermore,additional needs are required in the future wireless communicationsystems/beyond 5G, such as decreased Transmission Time Interval (TTI)boundaries or large packet sizes, are required to enable greater datathroughput post a challenge to strengthen data path protocol design forin the future wireless communication systems/beyond 5G.

Existing Fifth-Generation New Radio (5G-NR) wireless communicationssystem may handle peak cell throughputs in the tens of Gbps range, withper-user peak data rates in a couple of Gbps range. With advancements inradio access technology and exploration of higher bandwidths beyond 100GHz, a demand for peak per-user data rate throughput in the futurewireless communication systems/beyond 5G may easily exceed 100 Gbps. Asubcarrier spacing is increased and the TTI time is reduced, to besupported, to a few microseconds to a few hundred nanoseconds forchannel characteristics of the THz bands. Furthermore, advancements inhigher-level protocols may necessitate large packet sizes to enable suchhigh data throughput/extremely high data rates. With such higher datathroughput and/or lower TTI boundaries and/or jumbo packet sizes, amodem protocol architecture must be strengthened to sustain and supportthese new needs for the future wireless communication systems/beyond 5G.Thus there is a need for various method(s) by which a protocol designcan be changed to support the new requirements (e.g. higher datathroughput and/or lower TTI boundaries and/or jumbo packet sizes) of thefuture wireless communication systems/beyond 5G.

In addition, existing multi-core processors are capable of supportingthe new requirements (NR data throughput requirements). For an NR mobiledevice (10), a standard quad-core system (equipped with a few HardwareAccelerators (HWA) such as a ciphering engine, a header parser, etc.) isutilized. The NR mobile device (10), the standard quad-core system cansupport a couple of Gbps Transmission Control Protocol (TCP)applications on a modem protocol stack including data plane processingunits like a Packet Data Convergence Protocol (PDCP) 10A1, a Radio LinkControl (RLC) 10A3 and a Medium Access Control (MAC) 10A4, asillustrated in FIG. 1A.

In addition, existing CPU utilization data indicates that this istypically the bottleneck for the high data throughput. For high datathroughput, the NR mobile device (10) uses a functional decomposition ora data decomposition. The functional decomposition is a mechanism forbreaking down a given function or task into smaller tasks that are doneone after the other. The data decomposition involves tasks that areparallelized. Because of interdependency between the multiplepackets/task in the same flow in the existing mechanism (e.g.functional/data decomposition) in the existing modem protocolarchitecture have a limited scope for parallelization. Theinterdependency is usually referred to as critical sections asconcurrent access for an update of any of the variables belonging tothis section needs to be protected. For example, in a Radio Link ControlLayer of the Receiver (RLC-RX), there are multiple critical sectionslike window management, segment reassembly, etc. Further, overheads ofthe critical sections in such parallel architecture reduce an overallefficiency of the existing multi-core processors. Thus there is a needfor reducing the critical sections for efficient parallelizationutilizing for full capability of the existing multi-core processors/NRmobile device (10).

In addition, each core's capability is fully utilized with a minimaloverhead of switching the tasks running on that core, and inter-coredependency (e.g. critical sections) is minimized and/or reduced orcompletely removed while ensuring a balanced distribution of workloadacross the cores for an efficient implementation on the existingmulti-core processors. A data plane protocol architecture should accountfor these issues to achieve the aforementioned efficient implementationon the existing multi-core processors. The Functional decompositionwithin a layer leads to some overhead as the RLC functionalities can'tbe equally distributed among different tasks across multiple multi-coreprocessors to make it truly and equally parallel with no criticalsection(s) and the functional decomposition is not inherently scalable.The data decomposition of a single RLC flow, through scalable, can alsolead to lots of overhead in managing a common RLC window and handlingRLC procedures when parallelizing one RLC flow over multiple processingcores. Thus there is a need for various method(s) for parallelizing RLCwith the data decomposition to achieve enormously high data throughput.

In addition, any presence of the critical sections limits the scaling ofthe parallel implementation because of a decrease in efficiency due tothe overhead(s). In some of the existing method(s), there is nofunctional decomposition of any functional layer in the modem protocolstack (pertaining to the data path functionality) and some of theexisting method(s) try to check for variants for the data decomposition.However, it doesn't restrict the existing systems to be purely a datadecomposition model nor does it restrict the solution to have acombination of the functional decomposition and data decomposition.Thus, it is desired to provide a useful alternative to support the newrequirements with efficient parallelization utilizing in the futurewireless communication systems/beyond 5G.

SUMMARY

Embodiments of the disclosure provide a method and network entity fordesigning a Logical Channel Priority (LCP) and/or resource allocationmechanism for a 6G and/or 5G system and/or beyond 5G system to achievehigh throughput/data rates. In addition, the method offersparallelization for various flows of data plane over several processorcores to achieve high throughput/data rate in the 6G and/or 5G systemand/or beyond the 5G system.

Embodiments of the disclosure provide a resource allocation at radiobearer level (DRB) or Logical channel group (LCG) or per bearer bufferor bearer queue for resource selection rather than at a logical channellevel.

Embodiments of the disclosure provide a configuration of LCP orresources selection parameters for multiple sub-flows like a PrioritizedBit Rate (PBR), a Bucket Size Duration (BSD) can be per bearer buffer orbearer queue or radio bearer per LCG or sub-flow (distribution amongmultiple flows of data plane).

Embodiments of the disclosure provide a new design for the allocation ofresources to achieve the high throughput/data rate in the 6G and/or 5Gsystem and/or beyond the 5G system. Where all the bearers or LCG orbearer buffer are allocated resources in a decreasing priority order upto corresponding PBR, resources have been allocated to multiple LogicalChannels (LCs) under the same bearer or LCG or bearer queue or buffer,and if any resources remain, all the bearers or LCG or bearer bufferserved in strict decreasing priority order until either the data forthat bearer or a UL grant is exhausted, whichever comes first. Where theselection of the LC for the allocation of resources depends upon adistribution scheme at a PDCP.

Embodiments of the disclosure allocate, by a MAC entity, the resourcesfirst to the LC which is carrying a control plane, and then allocate theresources to LC which is carrying data. Furthermore, the MAC entityfirst allocates the resources to the LC which is a primary LC thenshould allocate the resources to other secondary LCs under the samebearer.

A method, according to various example embodiments, for providingresource allocation in a wireless network is provided. The methodincludes: receiving, by a network entity, a plurality of data packets tobe prioritized belonging to a Data Radio Bearer (DRB) from a network toa User Equipment (UE) using a plurality of logical channels. Further,the method includes configuring, by the network entity, a Quality ofService (QoS) parameter, wherein the QoS parameter comprises a priority,a Prioritized Bit Rate (PBR), and a Bucket Size Duration (BSD). Further,the method includes allocating, by the network entity, the configuredQoS parameter to the DRB, logical channel, a Logical Channel Group(LCG), and a DRB buffer or queue. Further, the method includes dividing,by the network entity, the QoS parameter across one of the DRB, thelogical channel, the LCG, and a DRB buffer or queue. Further, the methodincludes sending, by the network entity, the plurality of data packetsto the UE by allocating at least one resource as per the PBR and theBSD.

In an example embodiment, the QoS parameter is configured by performing,by the network entity, one of configuring the PBR and the BSD based onthe DRB or configuring the PBR and the BSD based on the LCG orconfiguring the PBR and the BSD based on the DRB buffer or queue orconfiguring the PBR and the BSD based on the logical channel.

In an example embodiment, the configuring the PBR and the BSD based onthe DRB includes detecting, by the network entity, that the DRB with alogic channel and configuring, by the network entity, a value of thePBR, the BSD, and the UE parameter for each DRB, where each DRBcomprises the plurality of logical channels.

In an example embodiment, the configuring the PBR and the BSD based onthe LCG includes detecting, by the network entity, that the DRB havemultiple logic channel, where the multiple logic channel belongs to asingle LCG and configuring, by the network entity, a value of the PBR,the BSD, and the UE parameter for each LCG, where each LCG comprises theplurality of logical channels, where each LCG comprises a uniqueIdentity (ID).

In an example embodiment, the configuring the PBR and the BSD based onthe DRB buffer or queue includes configuring, by the network entity, avalue of the PBR, the BSD, and the UE parameter for each DRB buffer orqueue, where each MAC entity of the network entity maintains the DRBbuffer or queue and stores data of the DRB buffer or queue fromdifferent logical channel under same DRB bearer or IP flow

In an example embodiment, resource allocation directly runs on the DRBbuffer or queue, and size of the DRB buffer or queue depends on atransmitting window of RLC and is based on the PBR and the BSD.

In an example embodiment, the configuring the PBR and the BSD based onthe logical channel includes detecting, by the network entity, thatmultiple logic channels under the same DRB and configuring, by thenetwork entity, a value of the PBR, the BSD, and the UE parameter foreach logical channel of the plurality of logical channels.

In an example embodiment, the QoS parameter is configured through one ofa Radio Resource Control (RRC) message and a layer-2 message.

In an example embodiment, allocating, by the network entity, theconfigured QoS parameter to the DRB includes distributing, by thenetwork entity or the UE, the value of the PBR and the BSD amongmultiple logic channels based on a PDCP distribution, where the networkentity is configured the PDCP distribution in a Radio Resource Control(RRC) message.

In an example embodiment, the PDCP distribution comprises a sequentialdistribution or a random distribution, a block distribution or a batchdistribution, and a split threshold-based distribution.

In an example embodiment, the sequential distribution or the randomdistribution includes assigning, by the network entity, a PDCP-ProtocolData Unit (PDU) to a sub-flow of a Radio link control (RLC) in around-robin manner and mapping, by the network entity, the PDCP-PDU tothe sub-flow of the RLC.

In an example embodiment, the block distribution or the batchdistribution includes one of mapping, by the network entity and/or theUE, a batch of sequential PDCP-PDUs to one sub-flow of the RLC; mapping,by the network entity and/or the UE, the PDCP-PDUs with least bufferoccupancy; mapping, by the network entity and/or the UE, the PDCP-PDUsbased on a processing capability of the UE; and mapping, by the networkentity and/or the UE, the PDCP-PDUs based on a number of transmissionsof the plurality of data packets.

In an example embodiment, distributing, by the network entity or the UE,the value of the PBR and the BSD among multiple logic channels based onthe PDCP distribution includes determining, by the network entity,whether the PDCP distribution is the sequential distribution or theblock distribution and performing, by the network entity, one of:equally distributing the value of the PBR to each logical channel of theplurality of logical channels in response to determining that the PDCPdistribution is the sequential distribution or the block distribution;and distributing the value of the PBR to each logical channel of theplurality of logical channels based on an uplink split threshold valuein response to determining that the PDCP distribution is not thesequential distribution or the block distribution, where the uplinksplit threshold configured by the network entity or based on thecapability of the UE.

In an example embodiment, distributing, the value of the PBR to eachlogical channel of the plurality of logical channels based on the uplinksplit threshold value includes configuring, by the network entity, theuplink split threshold, determining, by the network entity, whether dataavailable for transmission is greater than or equal to the uplink splitthreshold and performing, by the network entity, one of: mappingPDCP-PDUs to a primary logical channel of the plurality of logicalchannels in response to determining that the data available fortransmission is greater than or equal to the uplink split threshold; andmapping PDCP-PDUs to a-second logical channel of the plurality oflogical channels in response to determining that the data available fortransmission is not greater than or equal to the uplink split threshold.

In an example embodiment, the method includes sending, by the networkentity, a resource to the UE, where the UE sends a transport block usingscheduling to inform a Modulation and Coding Scheme (MCS), no ofresource blocks through which the UE determines size of the transportblock.

In an example embodiment, the method includes receiving, by the UE, theresource from the network entity. Further, the method includesallocating, by the UE, the received resource to one of the DRB, thelogical channel, the LCG, and the DRB buffer, where the resource isallocated in decreasing priority order up to corresponding the PBR andthe resource is allocated based on the PDCP distribution. Further, themethod includes determining, by the UE, whether the PDCP distribution isthe sequential distribution. Further, the method includes performing, bythe UE, one of: selecting data PDU from each logical channel until thePBR limit is reached in response to determining that the PDCPdistribution is the sequential distribution; and selecting data PDU inbatches from each logical channel until the PBR limit is reached inresponse to determining that the PDCP distribution is nor the sequentialdistribution. Further, the method includes detecting, by the UE that thedata PDU is pending in a logical channel. Further, the method includesdetecting, by the UE, that the detected data PDU in strict decreasingpriority order. Further, the method includes allocating, by the UE,pending resources to all the DRB or LCG or bearer queues until eitherthe data PDU for that DRB or a UL grant is exhausted for that DRB.

Accordingly, various example embodiments herein provide the networkentity in the wireless network. The network entity includes: a logicalchannel controller coupled with a processor and a memory. The logicalchannel controller is configured to: receive a plurality of data packetsto be prioritized belonging to the DRB from a network to the UE usingthe plurality of logical channels. Further, the logical channelcontroller is configured to set a quality of service (QoS) parameter,where the QoS parameter comprises the priority, a prioritize bit rate(PBR), and a bucket size duration (BSD). Further, the logical channelcontroller is configured to allocate the configured QoS parameter to adata radio bearer (DRB), the logical channel, a logical channel group(LCG), and the DRB buffer or queue. Further, the logical channelcontroller is configured to divide the QoS parameter across one of theDRB, the logical channel, the LCG, and the DRB buffer or queue. Further,the logical channel controller is configured to send the plurality ofdata packets to user equipment (UE) by allocating at least one resourceas per the PBR and the BSD.

Accordingly, various example embodiments herein provide the UE in thewireless network. The network entity includes a logical channelcontroller coupled with a processor and a memory. The logical channelcontroller is configured to receive the resource(s) from the networkentity. Further, the logical channel controller is configured toallocate the received resource(s) to one of the DRB, the logicalchannel, the LCG, and the DRB buffer, where the resource(s) is allocatedin decreasing priority order up to corresponding the PBR and theresource(s) is allocated based on the PDCP distribution. Further, thelogical channel controller is configured to determine whether the PDCPdistribution is the sequential distribution. Further, the logicalchannel controller is configured to select data PDU from each logicalchannel until the PBR limit is reached in response to determining thatthe PDCP distribution is the sequential distribution. Further, thelogical channel controller is configured to select data PDU in batchesfrom each logical channel until the PBR limit is reached in response todetermining that the PDCP distribution is not the sequentialdistribution. Further, the logical channel controller is configured todetect that the data PDU is pending in the logical channel. Further, thelogical channel controller is configured to detect that the detecteddata PDU is in strict decreasing priority order. Further, the logicalchannel controller is configured to allocate pending resources to allthe DRB or LCG or bearer queues until either the data PDU for that DRBor a UL grant is exhausted for that DRB.

These and other aspects of the various example embodiments herein willbe better appreciated and understood when considered in conjunction withthe following description and the accompanying drawings. It should beunderstood, however, that the following descriptions, while indicatingvarious example embodiments and numerous specific details thereof, aregiven by way of illustration and not of limitation. Many changes andmodifications may be made within the scope of the disclosure hereinwithout departing from the spirit thereof, and the example embodimentsherein include all such modifications.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features and advantages of certainembodiments of the present disclosure will be more apparent from thefollowing detailed description, taken in conjunction with theaccompanying drawings, in which:

FIG. 1A is a diagram illustrating a functionality overview for dataplane which includes processing at layers related to data planeprocessing, according to the prior art;

FIG. 1B is a diagram illustrating an issue with existing Logical ChannelPrioritization (LCP) procedure, according to the prior art;

FIG. 1C is a diagram illustrating an example scenario in which a UserEquipment (UE) allocates resources to logical channels, according to theprior art;

FIG. 2 is a flow diagram illustrating parallelization of data packetprocessing per radio bearer flow or IP flow or logical channel flow orphysical channel flow or transport channel flow, according to variousembodiments;

FIG. 3 is a diagram illustrating parallelization of the data packetprocessing per radio bearer flow, according to various embodiments;

FIG. 4A is a block diagram illustrating an example configuration of anetwork entity for prioritizing the logical channel(s) in 6G networksand beyond, according to various embodiments;

FIG. 4B is a block diagram illustrating an example configuration of a UEentity for prioritizing the logical channel(s) in the 6G networks andbeyond, according to various embodiments;

FIGS. 5A and 5B are flowcharts illustrating an example method forconfiguring Quality of Service (QoS) parameter values for management oflogical channel(s) in the 6G networks and beyond, according to variousembodiments;

FIG. 6 is a flowchart illustrating an example method for allocatingresource(s) in the 6G networks and beyond, according to variousembodiments; and

FIG. 7 is a diagram illustrating an example method for allocatingresource(s) in the 6G networks and beyond, according to variousembodiments.

DETAILED DESCRIPTION

The example embodiments herein and the various features and detailsthereof are explained more fully with reference to the non-limitingembodiments that are illustrated in the accompanying drawings anddetailed in the following description. Descriptions of well-knowncomponents and processing techniques may be omitted so as to notunnecessarily obscure the embodiments herein. The various embodimentsdescribed herein are not necessarily mutually exclusive, as someembodiments can be combined with one or more other embodiments to formnew embodiments. The term “or” as used herein, refers to a non-exclusiveor, unless otherwise indicated. The examples used herein are intendedmerely to facilitate an understanding of ways in which the embodimentsherein can be practiced and to further enable those skilled in the artto practice the embodiments herein. Accordingly, the examples should notbe construed as limiting the scope of the embodiments herein.

As is traditional in the field, embodiments may be described andillustrated in terms of blocks which carry out a described function orfunctions. These blocks, which may be referred to herein as managers,units, modules, hardware components or the like, are physicallyimplemented by analog and/or digital circuits such as logic gates,integrated circuits, microprocessors, microcontrollers, memory circuits,passive electronic components, active electronic components, opticalcomponents, hardwired circuits and the like, and may optionally bedriven by firmware. The circuits may, for example, be embodied in one ormore semiconductor chips, or on substrate supports such as printedcircuit boards and the like. The circuits of a block may be implementedby dedicated hardware, or by a processor (e.g., one or more programmedmicroprocessors and associated circuitry), or by a combination ofdedicated hardware to perform some functions of the block and aprocessor to perform other functions of the block. Each block of theembodiments may be physically separated into two or more interacting anddiscrete blocks without departing from the scope of the disclosure.Likewise, the blocks of the embodiments may be physically combined intomore complex blocks without departing from the scope of the disclosure.

The accompanying drawings are used to aid in understanding varioustechnical features and it should be understood that the exampleembodiments presented herein are not limited by the accompanyingdrawings. As such, the present disclosure should be construed to extendto any alterations, equivalents and substitutes in addition to thosewhich are particularly set out in the accompanying drawings.

Throughout this disclosure, the terms “logical channel”, “LCH′ and “LC”may be used interchangeably. Throughout this disclosure, the terms“logical channels” and “LCs” may be used interchangeably.

FIG. 1A is a diagram illustrating a functionality overview for the dataplane which includes processing at layers related to data planeprocessing, according to the prior art.

A typical modem communication protocol design system that involves theprocessing of layers (e.g. 10A1-10A4), of a UE (10), related to dataplane processing such as Service Data Adaptation Protocol (SDAP) layer(10A1), Packet Data Convergence Protocol (PDCP) layer (10A2), Radio LinkControl (RLC) layer (10A3), and Medium Access Control (MAC) layer(10A4). The SDAP Layer (10A1) is involved with mapping between Qualityof Service (QoS) Flow and Data Radio Bearer (DRB). The PDCP layer (10A2)deals with security, Robust Header Compression (ROHC), and Split Bearer.The RLC layer (10A3) deals with Automatic Repeat reQuest (ARQ) andSegmentation. The MAC layer (10A4) deals with scheduling, concatenation,and Hybrid Automatic Repeat reQuest (HARQ).

FIG. 1B is a diagram illustrating an issue with an existing LogicalChannel Prioritization (LCP) procedure, according to the prior art;

According to specification TS 38.321, uses the Logical ChannelPrioritization (LCP) method whenever a new transmission is performed.RRC manages uplink data scheduling by signaling for each logical channelper MAC entity:

-   a. Priority: An increasing priority value indicates a lower priority    level, whereas a decreasing priority value indicates a higher    priority level, priority of each logical channel.-   b. Prioritized Bit Rate (PBR): This defines the average bit rate for    each Logical Channel (LC) which the UE (10) should be able to    fulfill to meet the provisioned QoS defined for each LC. The PBR is    the data rate provided to one LC before allocating any resource to a    lower-priority LC.-   c. Bucket Size Duration (BSD): This defines the upper time limit for    continuous accumulation of data for each LC. This parameter is used    to avoid starvation for lower priority LC. The BSD is used to set    the maximum amount of pending data allowed for an LC. For an LCID    the bucket size=BSD×PBR (both are in MAC_config struct) is the    maximum UL data an LCID can buffer.-   d. UE variable (Bj) for the LCP: Bj is maintained for each LC. The    MAC entity shall initialize Bj of the LC to zero when the LC is    established. For each LCj, the MAC entity:    -   i. Increment Bj by the product PBR×T before every instance of        the LCP procedure, where T is the time elapsed since Bj was last        incremented;    -   ii. If the value of Bj is greater than the bucket size (e.g.        PBR×BSD) then set Bj to the bucket size.

Each DRB has one LC (10B1). Each LC is associated with the LCPparameters (e.g. PBR, BSD, etc.) that are required to meet a QoSrequirement(s). An issue with the existing LCP procedure: In the priorart there are two scenarios where radio bearer (e.g. DRB) can havemultiple LC,

-   -   a. Split bearer scenario (10B2) where one DRB has two LCs. In        this scenario, these LCs mapped to different MAC entities. In        this case, the PBR value can be the same or separate depending        on an uplink split threshold. Each Link has a minimum PBR value        that is equivalent to bearer QoS requirements. A network may set        the same value for the PBR or may set the high value of PBR        which is of primary transmitting link.    -   b. PDCP duplication scenario where one DRB can have more than        two LCs. In this case, there will be a single MAC entity but the        logical channel can be mapped to a different carrier. The PBR        and other parameters have been the same for both the LCs and new        rules which are based on restriction of selection of LC have        been defined. There is no issue in LCP in case a single DRB is        mapped to multiple LCs and the same MAC entity due to different        grants from different carriers.

An issue with the existing configuration of the LCP parameters values:the existing mechanism configures the LCP parameters (e.g. PBR, BSD) perLC so that the LCP parameters can fulfill the QoS requirements when DRBis served through more than one LC during split bearer or PDCPduplication. In the existing mechanism packets shared with MAC is alwayssequential in uplink under the same link. One possible option is to usereuse the existing mechanism for new architecture e.g. networkconfigures the LCP parameters values for each LC as per the QoSrequirement of the bearer. In this case, each LC will be allocated withthe PBR which is equivalent to the QoS of the bearers. This will lead tostarvation of other LCs of lower priority as each LC (under the sameDRB) will be allocated the resources as per the PBR and have the samepriority.

-   -   a. If the data is distributed sequentially to each LC, then if        the user reuses the existing LCP mechanism which may lead to        high reordering issues on the receiver side at gNB as the UE        (10) first allocates the resources as per the PBR.    -   b. Another possible cause is distribution mechanism can be based        on batch processing for each LC. If the distribution of packets        is perfectly aligned with resource allocation then there may not        be an issue as an assumption here is whatever packet PDCP is        giving in each TTI to each LC, it will immediately be sent to        the network which may again lead to reordering issues. There is        a need to define a new mechanism where the UE (10) should select        the next LC based on distribution/selection in previous TTI else        it can lead to reordering issues.

Another aspect could be if the distribution mechanism is based on athreshold set by the network for each LC. In this case, the upper layerdistributes the packets to other LC when it crosses the threshold. TheUE (10) starts using the second or more LC when the data rate crossesthe thresholds. In this case, the MAC entity or cell or carrier can bethe same, the MAC entity may first allocate the resources to LCs underthe same DRB. This case is different from the existing mechanism asthere in such cases different MAC entities handle such situations, whichmay lead to starvation for other LCs of lower priority.

In case the user reuses the existing mechanism to allocate the LCPrelated parameters for each LC then it may lead to a high reorderingissue and starvation for other LCs of lower priority if each LCH withinthe same DRB has the same PRB value. Due to the mapping of a singlebearer to multiple LCs, the same mechanism cannot be reused as the PBRcan become very high per bearer and it may cause an issue to otherconfigured bearers which are of low priority. The same issue can existif LCP or any other similar procedure is used to assigned or allocateresources to different services at any other layer.

FIG. 1C is a diagram illustrating an example scenario in which the UE(10) allocates resources to logical channels, according to the priorart.

As per 3GPP 38.300, the UE (10) has an uplink rate control function thatmanages the sharing of uplink resources between LCs. RRC controls theuplink rate control function by giving each LC's priority, PBR, and BSD.The values of the PBR and BSD signaled need not be related to the onessignaled via NG to the gNB.

Impact on the LCP method due to multiple LC under same bearer or IPflow: The uplink rate control function ensures that the UE (10) servesthe LCs in the following sequence:

-   -   a. All relevant LCs are allocated resources in a decreasing        priority order up to the corresponding PBR value;    -   b. If any resources remain, all the LCs are served in strict        decreasing priority order until either the data for that LC or        the UL grant is exhausted, whichever comes first.        -   iii. All relevant LCs in decreasing priority order up to            corresponding PBR value;        -   iv. All relevant LCs in the decreasing priority order for            the remaining resources assigned by the grant.

If more than one LC has the same priority, the UE (10) may serve themequally. The FIG. 1C denotes LC 1, 2, 3 with their designatedpriorities. The PBR is allocated and as per their priority in case thereare any more resources left then they are also allocated as per thepriority (steps/operations “1”, “2” and “3” perform first thenstep/operation “4”). In this case, the UE allocates the resources basedon the priority of logical channel and PRB. The UE selects the logicalchannel with priority 1 as shown in step-1 and select the data up toPRB. Then UE will select the data for priority channel 2, at step-2 itwill again select the data up to PRB or the amount of data availablewhich is less than PRB. If resources are still left, it will check thelogical channel with priority 3, at step-3 and select the data which canbe sent to the network. Once UE performs the selection for all thelogical channels up to PRB, if it has still resources then again willstart with the logical channel with high priority as shown in step-4.

Consider a case where there are multiple LCs under the same DRB with thesame priority. There is no existing mechanism in the prior art thatdefines how to select the LCH with the same priority. In the existingmechanism, there can be LC with the same priority but in a newlyproposed mechanism where the same DRB can have multiple LCH with thesame priority, there is a need to define a procedure for the selectionof LC. There is a need to define a mechanism where the UE (10) shouldselect the LC based on distribution or allocation in previous TTI.

As per 3GPP 38.300, there is a single LC per DRB and each LC receivedpacket is in the sequence. In the proposed scheme multiple LC canreceive the packets under different distribution mechanisms which cannotbe in sequence. If the existing mechanism is reused, the UE (10) may endup sending the out-of-order packets and can cause reordering delay. Toavoid reordering issues, the UE (10) has to ensure that selection of LCaligns with the distribution mechanism. There is a need to define amechanism under which have to allocate resources under the same DRB formultiple LCs serving through the same carrier or multiple carriers. Tosupport high data rates existing mechanism may not be sufficient and anew mechanism needs to be defined. There is a need to redesign the LCPas well as allocation of parameters associated with the LCP procedure.

Accordingly, various example embodiments provide a method for logicalchannel management in a wireless network. The method includes receiving,by a network entity, a plurality of data packets to be prioritizedbelonging to a Data Radio Bearer (DRB) from a network to a UserEquipment (UE) using a plurality of logical channels. Further, themethod includes configuring, by the network entity, a Quality of Service(QoS) parameter, where the QoS parameter comprises a priority, aPrioritized Bit Rate (PBR), a Bucket Size Duration (BSD), and a UEparameter (Bj). Further, the method includes allocating, by the networkentity, the configured QoS parameter to the DRB. Further, the methodincludes dividing, by the network entity, the QoS parameter across oneof a DRB, a logical channel, a Logical Channel Group (LCG), and a DRBbuffer or queue. Further, the method includes sending, by the networkentity, the plurality of data packets as per the PBR.

Accordingly, various example embodiments herein provide the networkentity for resource allocation in the wireless network. The networkentity includes a logical channel controller coupled with a processorand a memory. The logical channel controller is configured to receivethe plurality of data packets to be prioritized belonging to the DRBfrom a network to the UE using the plurality of logical channels.Further, the logical channel controller is configured to set the QoSparameter, where the QoS parameter comprises the priority, the PBR, andthe BSD. Further, the logical channel controller is configured toallocate the configured QoS parameter to the DRB, the logical channel,the LCG, and the DRB buffer or queue. Further, the logical channelcontroller is configured to divide the QoS parameter across one of theDRB, the logical channel, the LCG, and the DRB buffer or queue. Further,the logical channel controller is configured to send the plurality ofdata packets to the UE by at least one resource as per the PBR and theBSD.

Accordingly, various example embodiments herein provide the UE forresource allocation in the wireless network. The network entity includesa logical channel controller coupled with a processor and a memory. Thelogical channel controller is configured to receive the resource(s) fromthe network entity. Further, the logical channel controller isconfigured to allocate the received resource(s) to one of the DRB, thelogical channel, the LCG, and the DRB buffer, where the resource(s) isallocated in decreasing priority order up to corresponding the PBR andthe resource(s) is allocated based on the PDCP distribution. Further,the logical channel controller is configured to determine whether thePDCP distribution is the sequential distribution. Further, the logicalchannel controller is configured to select data PDU from each logicalchannel until the PBR limit is reached in response to determining thatthe PDCP distribution is the sequential distribution. Further, thelogical channel controller is configured to select data PDU in batchesfrom each logical channel until the PBR limit is reached in response todetermining that the PDCP distribution is not the sequentialdistribution. Further, the logical channel controller is configured todetect that the data PDU is pending in the logical channel. Further, thelogical channel controller is configured to detect that the detecteddata PDU is in strict decreasing priority order. Further, the logicalchannel controller is configured to allocate pending resources to allthe DRB or LCG or bearer queues until either the data PDU for that DRBor a UL grant is exhausted for that DRB.

Accordingly, various example embodiments provide a design of logicalchannel prioritization procedure or resource allocation or selection ofbearers or application for sending data for 6th Generation (6G) system.A proposed method, network entity, and UE for enhancing Logical channelprioritization (LCP) for high-speed data throughput for 5G system orbeyond 5G systems including future 6G and subsequent generations ofwireless systems. Further, the method includes addressing theimplementation and specification changes required for a typical modemtransmitter and receiver design for processing the data related to acommunication protocol. Further, the method includes an implementationfor a high throughput modem protocol system. Further, the methodincludes a flexible design with an optimal number of cores to supportthe high throughput requirement without compromising performance of thenetwork entity and the UE.

Further, a method according to various example embodiments deals withthe field of a mobile communication protocol. According to variousembodiments, the example method may list down all the possible variantsfor the LCP or any other resource allocation methods which can beutilized for very high data throughput. The example method may addressthe implementation and specification change required for a typical modemtransmitter (TX) and receiver (RX) design for processing data related toa communication protocol and suggests modifications to existing design(e.g. 2G system, 3G system, 4G system, etc.) and specification to easethe implementation for a high throughput modem protocol system. Thevarious example embodiments have a flexible design with the optimalnumber of cores to support the high throughput requirement withoutcompromising for the performance and is directed for a futurecommunication protocol specification that has huge data required forprocessing.

In an example method, the core functionality is considered to be basedupon the 3rd Generation Partnership Project (3GPP 5G) New Radiospecifications but this should be treated for illustration purposesonly. For a data plane packet, all the packets go through the data planelayers one after another in a sequential manner. Further, there are norestrictions on following the New Radio (NR) specification precisely butexpecting basic services to the layers above and below. However, theexample method does not restrict the ideology to be related to only thelayered architecture as per NR. In spirit, if any future protocol systemhaving a different layered architecture, the concepts of LCP forparallelizing multiple sub-flows still are valid in principle. Theprotocol layers from NR specification along with their functionalitiesare mentioned only for indicative purposes. However, the proposed methoddoes not intend to restrict any further simplifications andoptimizations to the current NR specification.

Referring now to the drawings and more particularly to FIGS. 2, 3, 4A,4B, 5A, 5B, 6 and 7, where similar reference characters denotecorresponding features throughout the figures, there are shown variousexample embodiments.

FIG. 2 is a flow diagram illustrating parallelization of data packetprocessing per radio bearer flow or IP flow or logical channel flow orphysical channel flow or transport channel flow, according to variousembodiments.

Referring to FIG. 2, an example method to achieve high data rates isillustrated. The functionality of the distributor further comprisesdistribution of data packets from the incoming said radio flow or IPflow to one or more multiple sub-flows as shown in FIG. 2. Adistributor/an aggregator module (201) can be based on any of NR modulewhich can be the SDAP or the PDCP or the RLC or the MAC or the physicallayer (PHY) or any other new module or IP flow or TCP module which canbe based on the 5G system or 6G system or any other next-generationtechnology. The functionality of the distributor (201) further comprisesdistribution of data packets based on one of the methods likesequential, random, block, load-based processing capability-based logic,heuristic-based approach, or a combination of any of these schemesdescribed.

The distributor (201) provides the data packets to different sub-flowswhich can be based on any existing module or protocol or new module orprotocol (202 a, 202 b . . . 202N). The aggregator (201) functionalityfurther comprises of aggregator of receiving the data from differentprotocol sub-flow. These multiple sub-flows can be mapped to single ormultiple component carriers on any existing module or protocol or newmodule or protocol. The multiplexing or de-multiplexing entity (203) isresponsible for the assembly or de-assembly of packets from differentsub-flows.

FIG. 3 is a diagram illustrating parallelization of the data packetprocessing per radio bearer flow, according to various embodiments.

To achieve high data rates an example method is based on parallelizationof data packet processing per radio bearer flow as illustrated in FIG.3. Where at a transmitter (301 a, 302 a, 303 a, 304 a, 305 a)/receiver(301 b, 302 b, 303 b, 304 b, 305 b), the said transport layer (301 a,301 b) flow is mapped to one radio flow at the PDCP layer (302 a, 302b). In this case, radio flow mapped to multiple RLC sub-flows (303 a,303 b) at the PDCP layer (302 a, 302 b) through functionality referredto as a distributor. The RLC layer (303 a, 303 b) functionality isperformed independently on different threads either the same or logicalcores for the said sub-flows, where there is no inter-dependency of theRLC layer (303 a, 303 b) functionality among the sub-flows. The MAClayer (304 a, 304 b) multiplexing the data packets from one or moresub-flows into one MAC data packet and delivering it to the PHY layer(305 a, 305 b) for transmission. Another possibility is in the case ofmultiple carriers, one RLC layer (303 a, 303 b) sub-flow can be mappedto one or many MAC carriers, also many RLC layers (303 a, 303 b)sub-flows can be mapped to a single MAC carrier as well or an RLCsub-flow can be mapped to multiple MAC entities/layer (304 a, 304 b) orone or many RLC sub-flows can be mapped to a single MAC entity/layer(304 a, 304 b).

The example method and procedure are applicable for any of theparallelization methods, which is required for high-speed datathroughput for beyond 5G systems. The example method can be based onparallel RLC layer (303 a, 303 b) sub-flow design with a single MAClayer (304 a, 304 b), parallel RLC layer (303 a, 303 b) sub-flow designwith multiple MAC entities/layer (304 a, 304 b), parallel PDCP layer(302 a, 302 b)+RLC layer (303 a,303 b) with single MAC entity/layer (304a, 304 b), parallel PDCP layer (302 a, 302 b)+RLC layer (303 a,303 b)design with multiple MAC entities/layer (304 a, 304 b), parallel PDCPlayer (302 a, 302 b)+RLC layer (303 a,303 b) design with distributor atPDCP (302 a, 302 b) only, data flow split at MAC entities/layer (304 a,304 b) and having parallel PHY layer (305 a, 305 b), data flow split atPDCP (302 a, 302 b), with parallel MAC entities/layer (304 a, 304 b),data flow split at RLC (303 a, 303 b) with parallel MAC entities/layer(304 a, 304 b) and parallel layer (305 a, 305 b), data flow split atSDAP with parallel PDCP layer (302 a, 302 b), RLC layer (303 a, 303 b),MAC entities/layer (304 a, 304 b), PHY layer (305 a, 305 b).

The example architecture has multiple possibilities as mentioned abovewhere one of design is one PDCP entity can have two or more RLC entities(LC) as shown in FIG. 3. In this case, both LC are mapped to the sameMAC entity and same carrier. This is different from prior art wheredifferent logical channels are mapped to a different carrier. The PDCPcan distribute the packets based on a threshold or sequentially or batchor any other method etc. to these different RLC entities or differentflows. The same is applicable for any other designs which can be appliedto any layer.

The example architecture's configuration of a PBR, a BSD, and otherparameters required for the LCP procedure: There are multiple solutionsthrough which these parameters can be configured and these methods areapplicable for any architecture or any layer.

Define the PBR, BSD, or QoS parameters per radio bearer: In case DRB hasmultiple LCs, it can distribute equally among all the LCs. This may workin the case when the PDCP is equally distributing data among multiplelogical channels.

Total PBR for bearer=PBR (LC1)+PBR (LC2)  (1)

The network (e.g. network entity) can also configure the PBR values foreach LC e.g. LC1=PBR1 or LC2=PBR2, etc. where the sum of PBR1 and PBR2is equal to the total PBR for that bearer. If the network can configurethe PBR value for the bearer, and it is up to the UE to decide how itsplits across multiple LC, that is an option. It may divide evenly amongmultiple LCs, or it may ensure that when allocating resources, the MACentity or any other layer only allocates until the bearer's PBR value isreached. The LC under the same DRB can be configured with the samepriority. Another QoS parameter like BSD, Bj can also be maintained perbearer or any other QoS parameter can be configured per bearer. Thenetwork can configure through an RRC message (it can be dedicated orcommon. The NW can configure the QOS parameter per DRB or Logicalchannel or logical channel group or DRB buffer or queue) or any otherlayer 2 messages (Layer 2 message can be through the MAC control elementor any other MAC message, PDCP status or control PDU, RLC status orcontrol PDU. These status PDU or message can have information of the QOSparameters), which can be configured per bearer or IP flow or TCP flow.

Define the PBR, BSD per LC: In this case, the network has to ensure ifmultiple LCs are configured under the same bearers, then configure thesame value of PBR, BSD for each LC under the same DRB or flow or IP flowor anything equivalent to that which is configured for specific service.

Total PBR of logical channel=PBR (LC1)=PBR (LC2)  (2)

Another example could be to distribute the value of PBR, BSD amongdifferent LC. This distribution can be based on a split threshold set bythe network or based on UE capability. This PBR can also be set based onthe distribution mechanism at the PDCP layer. The network can align thePBR, BSD, or any other QoS parameters as per the distribution mechanismat PDCP or any other layers. A mechanism to derive these individual LCPparameters for each LC is required to ensure the total QoS criteria forthe bearer.

Total PBR of bearer=PBR (LC1)+PBR (LC2)+PBR (LCx)  (3)

In any method of allocation of QOS parameters that contains PBR, BSD,Bj, etc., the network has to ensure that the values allocated to logicalshould not exceed the total QoS for that particular service or bearer.When changing the primary logical channel, the network may change theQOS values such as PBR, BSD, and so on. The network may also reconfigurethe values for logical channels using the MAC control elements or RRC,which may configure the PBR threshold or value per logical channel. Whenany logical channel is enabled or disabled or activated or deactivated;network can (re) configure these values per logical channel or bearerthrough RRC or MAC control element or enable the configuration forpre-configured values.

Define the PBR, BSD per logical channel group (LCG): As per prior art,the LC group ID field identifies the group of LCs whose buffer status isbeing reported. The length of the field is 3 bits. The DRB havingmultiple logical channels can belong to a single logical channel group.The LCG should only contain the logical channel(s) belonging to the samebearer or same service. The LCG can also be named as radio bearer groupwhich includes multiple LC belonging to the same bearer. The PBR, BSDcan be configured per LCG or radio bearer group. This radio bearer groupmay also have logical channels which are mapped to different bearers.The LCG can be associated with a single bearer or multiple bearers.

Total PBR of LCG=PBR (LC1)+PBR (LC2)+PBR (LCx)   (4)

Where these LC can map to the same bearer or flow or IP or applicationor service. The distribution of these values depends on the PDCPdistribution scheme as mentioned above which can be based on a specificthreshold or batching or sequential scheme.

Define the PBR, BSD per bearer buffer or bearer queue: MAC or any otherlayer can maintain the bearer queue and store the data from thedifferent LC in it. In this case, multiple logical channels associatedor flow with the same buffer are configured with a particular queuewhich is per bearer. The network can configure PBR, BSD per bearerbuffer, or bearer queue. Each bearer or IP flow or PDCP entity or SDAPentity or MAC entity can have a specific queue that stores data frommultiple SDAP entities or PDCP entity or RLC entity or MAC entity.Network (NW) can configure the PBR, BSD and other QoS parameters basedon this buffer queue so LCP or any other procedures which are used toallocate the resources can run the algorithm on these queues. This queuecan be configured per bearer or application or specific service or basedon QCI or QoS. UE and network can add the logical channel or beareridentifier or any other identifier for packets.

Proposed LCP procedure or Resource allocation Procedure: Variouspossible methods to perform the LCP or Resource allocation Procedure areillustrated as below.

The concept of LCP at bearer level Resource selection: LCP procedurecurrently is defined per logical channel which is associated withspecific bearers. In this new approach one bearer can have multiple LC'sso each LC may not be efficient and lead to starvation of low prioritylogical channel or reordering issue. LCP or data bearer prioritizationprocedure can be per bearer or DRB. The network can configure each DRBthrough RRC message with bearer priority, bearer PBR, bearer BSD, andother associated parameters required to form MAC SDU. Bj can bemaintained for each bearer (Bj which is maintained for each bearer j).

The UE variable Bj is used for the LCP procedure: The MAC entity shallinitialize Bj of the bearer to zero when the bearer is established. Foreach bearer j, irrespective of the total LCH the bearer is mapped to,the MAC entity shall update all the following at the bearer level:

-   -   a. Increment Bj by the product PBR×T before every instance of        the LCP procedure, where T is the time elapsed since Bj was last        incremented;    -   b. if the value of Bj is greater than the bucket size (e.g.        PBR×BSD):        -   i. Set Bj to the bucket size.

The exact moment(s) when the UE updates Bj between LCP procedures is upto UE implementation, as long as Bj is up to date at the time when agrant is processed by LCP.

The rules for the selection of bearer are similar as defined for aselection of LC in TS 38.321. UE allocates resources to the bearers inthe following steps:

-   -   a. Step A: All the bearers are allocated resources in a        decreasing priority order up to their PBR.    -   b. Step B: if any resources remain, all the bearers are served        in strict decreasing priority order until either the data for or        that bearer or the UL grant is exhausted, whichever comes first.

Each bearer includes multiple logical channels. There is a need todefine the handling of multiple LCs under the same bearer. The selectionof LC for the allocation of resources depends upon the distributionscheme at PDCP. There is a need to define the new mechanism where the UEshould select the next LCH based on distribution/selection in theprevious TTI. The one way could it within the same bearer as all-LC havesame priority then LC with high Bj value under same priority should bechosen first. In this case, the UE has to maintain the Bj per LC alsowhich can be handled by the existing LCP mechanism. The UE can alsomaintain some other parameter that can indicate the data that aparticular LC is having. The NW may configure PBR, BSD per LC or thesecan be handled per bearer. The selection of LC can also be based on around-robin manner. If the distribution scheme is based on sequentialallocation then the UE should allocate resources accordingly, if thereis batch processing then allocation should be aligning to that. The sameholds for other methods like based on threshold and another mechanism.

For example, take a case of LC1 and LC2 under the same bearer, say thedistribution of packets is done to the first LC1 and then LC2. UE shouldfirst allocate resources for LC1, The allocation of resources can befixed say x RLC PDUs, and then move to another LC2. This can also bedone as per the PBR limit set for each logical channel. If there aremultiple logical channels with the same priority under the same beareror different bearer then LC can be selected with a high Bj value orequivalent parameter which can refer to buffer status for that logicalchannel under the same priority. To avoid any reordering issues anderror scenarios, resource allocation should be aligned to thedistribution mechanism per logical channel.

The MAC entity shall, when a new transmission is performed logicalchannels selected for the UL, grant with Bj>0 or LC with high Bj valueunder same priority are allocated resources in decreasing priorityorder. If the PBR of a logical channel is set to infinity, the MACentity shall allocate resources for all the data that is available fortransmission on the logical channel before meeting the PBR of the lowerpriority logical channel(s); decrement Bj by the total size of MAC SDUsserved to logical channel j above.

In another example (306), each DRB can be configured with priority, PBR,BSD and other associated parameters required to form MAC SDU. The UEallocates resources to the bearers in the following steps,

-   -   a. Step A: All the bearers are allocated resources in a        decreasing priority order up to their PBR (“1”, “2”, and “3”).    -   b. Step B: Resources have been allocated to multiple logical        channels under the same bearer—Handling of multiple logical        channels under the same bearer (“4”, “5”, and “6”).        -   i. The selection of a logical channel for the allocation of            resources depends upon the distribution scheme at PDCP            and/or PBR value (if configured).        -   ii. In the example distribution scheme is considered as            sequential or batch and PBR is set as equal.    -   c. Step C: if any resources remain, all the bearers are served        in strict decreasing priority order until either the data for        that bearer or the UL grant is exhausted, whichever comes first        (“7”, “8”).

LCP at LCG: Each LCG can be configured with priority, PBR, BSD, andother associated parameters required to form MAC SDU. Bj can bemaintained for each LCG. The UE allocates resources to the LCG in thefollowing steps:

-   -   a. Step A: All the LCG are allocated resources in a decreasing        priority order up to their PBR.    -   b. Step B: if any resources remain, all the LCG are served in        strict decreasing priority order until either the data for that        LCG or the UL grant is exhausted, whichever comes first.        To handle the multiple LCs under the same LCG, there is a need        to define selection criteria. The selection of LC for the        allocation of resources depends upon the distribution scheme at        PDCP.

For example, take a case of LC1 and LC2 under the same LCG group. The UEshould first allocate resources for LC1, The allocation of resources canbe fixed say X RLC PDUs, then move to another LC2. This can also be doneas per the PBR limit set for each logical channel. If there are multiplelogical channels with the same priority under the same LCG or differentLCG then LC can be selected with a high Bj value under the samepriority. Another possibility could be MAC can allocate the resourcestill the logical channel have data e.g. schedule the LCH until data isavailable, rather than till Bj.

Enhancements to existing LCP: Each Logical channel can be configuredwith priority, PBR, BSD, and other associated parameters required toform MAC SDU. The network may configure a single PBR, BSD which isapplicable for each logical channel under the same bearer. Bj can bemaintained for each LC. The UE allocates resources to the LC in thefollowing steps, all the LCs are allocated resources in a decreasingpriority order up to their PBR or based on distribution mechanism at thePDCP level.

If PDCP is distributing packets sequentially or in batch then MAC shouldalso allocate the resources accordingly: this is applicable for LC withthe same priority or under the same bearer, the PBR can be taken care ofwhile selecting data from different LC.

If PDCP is distributing packets based on threshold then MAC should alsoallocate the resources accordingly: the MAC should first allocate theresources to the logical channel which is primary LC then shouldallocate the resources to another secondary LC under the same bearer,the amount of allocation is based on the threshold value and PBR can betaken care while allocating resources, the next time allocation can befirst done to secondary LC to ensure to avoid reordering delay, and theselection of LC for allocation of resources depends upon distributionscheme at PDCP.

LCP per bearer buffer or bearer queue: Each bearer queue can beconfigured with priority, PBR, BSD, and other associated parametersrequired to form MAC SDU. The network may configure a single PBR, BSDwhich is applicable for each bearer queue (Bj can be maintained for eachLCG).

The PDCP is distributing packets sequentially or in batch to differentlogical channels and after processing these packets can be delivered toa specific bearer or buffer queue, the UE allocates resources to thebearer queue in the following steps:

-   a. Step A: All the LCG are allocated resources in a decreasing    priority order up to their PBR.-   b. Step B: if any resources remain, all the LCG are served in strict    decreasing priority order until either the data for that LCG or the    UL grant is exhausted, whichever comes first.

Handling of data and control plane LC: In case there are only twological channels per bearer one is having Control data like RLC statusor TCP ACK or PDCP status and the other is dedicated to data. Then MACshould allocate the resources first to the LC which is carrying thecontrol plane and then allocate the resources to LC which is carryingdata. The network can allocate the PBR, BSD as per defined methods. TheUE allocates resources to the bearer queue in the following steps:

-   a. Step A: All the LC carrying control planes are allocated    resources in a decreasing priority order up to their PBR-   b. Step B: All the LC carrying data planes are allocated resources    in a decreasing priority order up to their PBR    If any resources remain, all the LC are served in strict decreasing    priority order until either the data for that LC or the UL grant is    exhausted, whichever comes first.

The above methods are described by considering the split at RLC but allthese methods can be applicable and scalable to any module which can beacting as aggregator or distribution say if there is split at PDCP thenresource allocation can be done per QOS flow or bearer level. In case UEhas multiple MAC entities which can be mapped to the same or multiplecarrier or cells or RAT. In that case allocation of resources can behandled based on the NW configuration, mapping between the MAC entityand Logical channel or flow or bearer, or any other combination. Thesame logic can be extended if the MAC entity is getting multiple grantsin the same TTI. The selection of bearer or flow or logical channel canbe based on any of the above-mentioned rules and combination ofallocation of NW parameters and selection of resource allocationprocedure.

FIG. 4A is a block diagram illustrating an example configuration of anetwork entity (100) (e.g. server, base station, eNodeB, gNodeB, cloudnetwork, etc.) for prioritizing the logical channel(s) in the Beyond 5G,6G networks and beyond, according to various embodiments.

In an embodiment, the network entity (100) includes a memory (110), aprocessor (e.g., including processing circuitry) (120), a communicator(e.g., including communication circuitry) (130), and a logical channelcontroller (e.g., including various circuitry) (140).

The memory (110) stores a QoS parameter (e.g. a priority, a PrioritizedBit Rate (PBR), a Bucket Size Duration (BSD), and a UE parameter (Bj),etc.) and a PDCP distribution (e.g. a sequential distribution or arandom distribution, a block distribution or a batch distribution, and asplit threshold-based distribution). Further, the memory (110) alsostores instructions to be executed by the processor (120). The memory(110) may include non-volatile storage elements. Examples of suchnon-volatile storage elements may include magnetic hard discs, opticaldiscs, floppy discs, flash memories, or forms of electricallyprogrammable memories (EPROM) or electrically erasable and programmable(EEPROM) memories. In addition, the memory (110) may, in some examples,be considered a non-transitory storage medium. The “non-transitory”storage medium is not embodied in a carrier wave or a propagated signal.However, the term “non-transitory” should not be interpreted that thememory (110) is non-movable. In some examples, the memory (110) can beconfigured to store larger amounts of information. In certain examples,a non-transitory storage medium may store data that can, over time,change (e.g., in Random Access Memory (RAM) or cache). The memory (110)can be an internal storage unit or it can be an external storage unit ofthe network entity (100), a cloud storage, or any other type of externalstorage.

The processor (120) may include various processing circuitry andcommunicates with the memory (110), the communicator (130), and thelogical channel controller (140). The processor (120) is configured toexecute instructions stored in the memory (110) and to perform variousprocesses. The processor (120) may include one or a plurality ofprocessors, including a general-purpose processor, such as, for example,and without limitation, a central processing unit (CPU), an applicationprocessor (AP), a dedicated processor, or the like, a graphics-onlyprocessing unit such as a graphics processing unit (GPU), a visualprocessing unit (VPU), and/or an Artificial intelligence (AI) dedicatedprocessor such as a neural processing unit (NPU).

The communicator (130) includes an electronic circuit specific to astandard that enables wired or wireless communication. The communicator(130) is configured for communicating internally between internalhardware components and with external devices via one or more networks.

In an embodiment, the logical channel controller (140) is implemented byprocessing circuitry such as logic gates, integrated circuits,microprocessors, microcontrollers, memory circuits, passive electroniccomponents, active electronic components, optical components, hardwiredcircuits, or the like, and may optionally be driven by firmware. Thecircuits may, for example, be embodied in one or more semiconductors.

In an embodiment, the logical channel controller (140) receives aplurality of data packets to be prioritized belonging to a Data RadioBearer (DRB) from a network to a User Equipment (UE) (200) using aplurality of logical channels. Further, the logical channel controller(140) configures a Quality of Service (QoS) parameter, where the QoSparameter comprises a priority, a Prioritized Bit Rate (PBR), a BucketSize Duration (BSD), and a UE parameter (Bj). The QoS parameter isconfigured through one of a Radio Resource Control (RRC) message and alayer-2 message.

Further, the logical channel controller (140) configures the PBR and theBSD based on the DRB and/or configures the PBR and the BSD based on theLCG and/or configures the PBR and the BSD based on the DRB buffer orqueue and/or configures the PBR and the BSD based on the logicalchannel.

Further, the logical channel controller (140) detects that the DRB witha logic channel and configures a value of the PBR, the BSD, and the UEparameter for each DRB, where each DRB comprises the plurality oflogical channels.

Further, the logical channel controller (140) detects that the DRB havemultiple logic channel, where the multiple logic channel belongs to asingle LCG and configures a value of the PBR, the BSD, and the UEparameter for each LCG, where each LCG comprises the plurality oflogical channels, where each LCG comprises a unique Identity (ID).

Further, the logical channel controller (140) configures a value of thePBR, the BSD, and the UE parameter for each DRB buffer or queue, whereeach MAC entity of the network entity (100) maintains the DRB buffer orqueue and stores data of the DRB buffer or queue from different logicalchannel under same DRB bearer or IP flow. Where resource allocationdirectly run on the DRB buffer or queue and size of the DRB buffer orqueue depends on a transmitting window of RLC, and is based on the PBRand the BSD.

Further, the logical channel controller (140) detects that multiplelogic channel under same DRB and configures a value of the PBR, the BSD,and the UE parameter for each logical channel of the plurality oflogical channels.

Further, the logical channel controller (140) allocates the configuredQoS parameter to the DRB by distributing the value of the PBR and theBSD among multiple logic channels based on a PDCP distribution, wherethe network entity (100) is configured the PDCP distribution in a RadioResource Control (RRC) message. The PDCP distribution comprises asequential distribution or a random distribution, a block distributionor a batch distribution, and a split threshold-based distribution.Further, the logical channel controller (140) assigns a PDCP-ProtocolData Unit (PDU) to a sub-flow of a Radio link control (RLC) in around-robin manner in the sequential distribution or the randomdistribution and maps the PDCP-PDU to the sub-flow of the RLC. Further,the logical channel controller (140) maps a batch of sequentialPDCP-PDUs to a sub-flow of the RLC and/or maps the PDCP-PDUs with leastbuffer occupancy and/or maps the PDCP-PDUs based on a processingcapability of the UE (200) and/or maps the PDCP-PDUs based on a numberof transmissions of the plurality of data packets in the blockdistribution or the batch distribution.

Further, the logical channel controller (140) determines whether thePDCP distribution is the sequential distribution or the blockdistribution. Further, the logical channel controller (140) equallydistributes the value of the PBR to each logical channel of theplurality of logical channels in response to determining that the PDCPdistribution is the sequential distribution or the block distribution.Further, the logical channel controller (140) distributes the value ofthe PBR to each logical channel of the plurality of logical channelsbased on an uplink split threshold value in response to determining thatthe PDCP distribution is not the sequential distribution or the blockdistribution, where the uplink split threshold configured by the networkentity (100) or based on the capability of the UE (200).

Further, the logical channel controller (140) configures the uplinksplit threshold. Further, the logical channel controller (140)determines whether data available for transmission is larger than orequal to the uplink split threshold. Further, the logical channelcontroller (140) maps PDCP-PDUs to a primary logical channel of theplurality of logical channels in response to determining that the dataavailable for transmission is larger than or equal to the uplink splitthreshold. Further, the logical channel controller (140) maps PDCP-PDUsto a-second logical channel of the plurality of logical channels inresponse to determining that the data available for transmission is notlarger than or equal to the uplink split threshold.

Further, the logical channel controller (140) divides the QoS parameteracross one of a DRB, a logical channel, a Logical Channel Group (LCG),and a DRB buffer or queue. Further, the logical channel controller (140)sends the plurality of data packets as per the PBR.

Further, the logical channel controller (140) sends a resource to the UE(200), where the UE (200) sends a transport block using scheduling toinform a Modulation and Coding Scheme (MCS), no of resource blocksthrough which the UE (200) determines size of the transport block.

Although the FIG. 4A shows various hardware components of the networkentity (100) it is to be understood that other embodiments are notlimited thereto. In various embodiments, the network entity (100) mayinclude less or more number of components. Further, the labels or namesof the components are used only for illustrative purpose and does notlimit the scope of the disclosure. One or more components can becombined together to perform same or substantially similar function tological channel management in the wireless network.

FIG. 4B is a block diagram illustrating an example configuration of theUE (200) entity for prioritizing the logical channel(s) in the 6Gnetworks and beyond, according to various embodiments.

In an embodiment, the UE (200) includes a memory (210), a processor(e.g., including processing circuitry) (220), a communicator (e.g.,including communication circuitry) (230), and a logical channelcontroller (e.g., including various circuitry) (240).

The memory (210) stores the QoS parameter the PDCP distribution andresource(s). Further, the memory (210) also stores instructions to beexecuted by the processor (220). The memory (210) may includenon-volatile storage elements. Examples of such non-volatile storageelements may include magnetic hard discs, optical discs, floppy discs,flash memories, or forms of electrically programmable memories (EPROM)or electrically erasable and programmable (EEPROM) memories. Inaddition, the memory (210) may, in some examples, be considered anon-transitory storage medium. The “non-transitory” storage medium isnot embodied in a carrier wave or a propagated signal. However, the term“non-transitory” should not be interpreted that the memory (210) isnon-movable. In some examples, the memory (210) can be configured tostore larger amounts of information. In certain examples, anon-transitory storage medium may store data that can, over time, change(e.g., in Random Access Memory (RAM) or cache). The memory (210) can bean internal storage unit or it can be an external storage unit of the UE(200), a cloud storage, or any other type of external storage.

The processor (220) may include various processing circuitry andcommunicates with the memory (210), the communicator (230), and thelogical channel controller (240). The processor (220) is configured toexecute instructions stored in the memory (210) and to perform variousprocesses. The processor (220) may include one or a plurality ofprocessors, maybe a general-purpose processor, such as a centralprocessing unit (CPU), an application processor (AP), or the like, agraphics-only processing unit such as a graphics processing unit (GPU),a visual processing unit (VPU), and/or an Artificial intelligence (AI)dedicated processor such as a neural processing unit (NPU).

The communicator (230) includes an electronic circuit specific to astandard that enables wired or wireless communication. The communicator(230) is configured for communicating internally between internalhardware components and with external devices via one or more networks.

In an embodiment, the logical channel controller (240) is implemented byprocessing circuitry such as logic gates, integrated circuits,microprocessors, microcontrollers, memory circuits, passive electroniccomponents, active electronic components, optical components, hardwiredcircuits, or the like, and may optionally be driven by firmware. Thecircuits may, for example, be embodied in one or more semiconductors.

In an embodiment, the logical channel controller (240) receives theresource from the network entity (100). Further, the logical channelcontroller (240) allocates the received resource to one of the DRB, thelogical channel, the LCG, and the DRB buffer, where the resource isallocated in decreasing priority order up to corresponding the PBR andthe resource is allocated based on the PDCP distribution. Further, thelogical channel controller (240) determines whether the PDCPdistribution is the sequential distribution. Further, the logicalchannel controller (240) selects data PDU from each logical channeluntil the PBR limit is reached in response to determining that the PDCPdistribution is the sequential distribution. Further, the logicalchannel controller (240) selects data PDU in batches from each logicalchannel until the PBR limit is reached in response to determining thatthe PDCP distribution is nor the sequential distribution.

Further, the logical channel controller (240) determines whether thedata PDU is pending in a logical channel. Further, the logical channelcontroller (240) determines whether the detected data PDU in a strictdecreasing priority order in response to determining that the data PDUis pending in the logical channel. Further, the logical channelcontroller (240) allocates pending resources to all the DRB or LCG orbearer queue until either the data PDU for that DRB or a UL grant isexhausted for that DRB when the data PDU is pending in the logicalchannel.

Although the FIG. 4B shows various hardware components of the UE (200)it is to be understood that other embodiments are not limited thereto.In various embodiments, the UE (200) may include less or more number ofcomponents. Further, the labels or names of the components are used onlyfor illustrative purpose and does not limit the scope of the disclosure.One or more components can be combined together to perform same orsubstantially similar function to logical channel management in thewireless network.

FIGS. 5A and 5B are flowcharts (500) illustrating an example method forconfiguring the QoS parameter values for management of logicalchannel(s) in 6G networks and beyond, according to various embodiments.The operations (501, 502, 503, 504, 505, 506, 507, 508, 509, 510 and511) are performed by the network entity (100).

At 501, the method includes configuring DRB with multiple LCs. At 502,the method includes the network entity (100) configures PBR and BSDbased on one of configuring PBR and BSD per bearer or configuring PBRand BSD per LCG or configuring PBR and BSD per bearer queue or buffer orconfiguring PBR and BSD per LC (based on total PBR). At 503, the methodincludes distributing the value of the PBR and the BSD among multipleLCs based on the PDCP distribution, where the network entity (100) isconfigured the PDCP distribution in the RRC message. The PDCPdistribution comprises the sequential distribution or the randomdistribution, the block distribution or the batch distribution, and thesplit threshold-based distribution. A distributor functionalitydistributes the packets to the RLC sub-flow either sequentially orrandomly. In this it assigns PDCP PDUs to RLC sub-flows in round-robinmanner, any PDCP PDU mapped to any RLC sub-flow. In a Batch or a Blockdistribution scheme, a batch of Sequential PDCP PDUs mapped to one RLCsub-flow. Which can be further decided based on load based upon bufferoccupancy where the PDCP distributor maps the PDCP PDU to the RLCsub-flow with the least buffer occupancy. Another could be processingcapability based, in this the PDCP distributor maps the PDCP PDU to theRLC sub-flow having max idle time. Another possibility could be aheuristic-based approach, where it distributes based on additionalinformation like a number of retransmissions, etc. Or it can be acombination of any of the above schemes/approaches.

At 504, the method includes determining whether the PDCP distribution isthe sequential distribution/the random distribution or the blockdistribution/the batch distribution.

At 505, the method includes equally distributing the value of the PBR toeach logical channel of the plurality of logical channels in response todetermining that the PDCP distribution is the sequentialdistribution/the random distribution or the block distribution/the batchdistribution (e.g. PBR (LC1)=PBR (LC2)=PBR (LCN) Total PBR=PBR (LC1)+ .. . . PBR (LCN)). At 506, the method includes distributing the value ofthe PBR to each logical channel of the plurality of logical channelsbased on an uplink split threshold value in response to determining thatthe PDCP distribution is not the sequential distribution/the randomdistribution or the block distribution/the batch distribution, where theuplink split threshold configured by the network entity or based on thecapability of the UE (200).

At 507, the method includes configuring the uplink split threshold (e.g.PBR (LC1)=value based on threshold configured by the network, PBR (LC2),PBR (LCN)<PBR (LC1). At 508, the method includes determining whetherdata available for transmission is larger than or equal to the uplinksplit threshold. At 509, the method includes mapping PDCP-PDUs to aprimary logical channel of the plurality of logical channels in responseto determining that the data available for transmission is larger thanor equal to the uplink split threshold. At 510, the method includesmapping PDCP-PDUs to the second logical channel of the plurality oflogical channels in response to determining that the data available fortransmission is not larger than or equal to the uplink split threshold.At 511, the method includes equally distributing the value of the PBR toeach logical channel of the plurality of logical channels in response todetermining that the PDCP distribution is the sequentialdistribution/the random distribution or the block distribution/the batchdistribution (e.g. PBR (LC1)=PBR (LC2)=PBR (LCN) Total PBR=PBR (LC1)+ .. . PBR (LCN)).

In the case of the PBR, the BSD parameters are configured per bearerqueue or buffer. Each MAC entity maintains this queue per bearer. Thisqueue or buffer can store the data from different logical channels underthe same bearer or IP flow. The NW can configure the PBR, the BSD perbearer buffer, or bearer queue. The resource allocation will directlyrun on the bearer queue or buffer. Size of bearer queue can be eitherdepending on RLC TX window or multiplication of the BSD and the PBR(e.g. BSD×PBR) that is the maximum UL data a bearer can buffer.

The various actions, acts, blocks, steps, or the like in the flowdiagram (500) may be performed in the order presented, in a differentorder or simultaneously. Further, in various embodiments, some of theactions, acts, blocks, steps, or the like may be omitted, added,modified, skipped, or the like without departing from the scope of thedisclosure.

FIG. 6 is flowchart (600) illustrating an example method for allocatingresource(s) in the 6G networks and beyond, according to variousembodiments. The operations (601, 602, 603, 604, 605, 606, 607, 608, 609and 610) are performed by the network entity (100) and the UE (200).

The UE (200) allocates resources to the bearers in the following steps:

-   -   a. Step A: All the bearers are allocated resources in a        decreasing priority order up to their PBR.    -   b. Step B: Resources have been allocated to multiple logical        channels under the same bearer. The selection of a logical        channel for the allocation of resources depends upon the        distribution scheme at PDCP and/or PBR value.    -   c. Step C: if any resources remain, all the bearers are served        in strict decreasing priority order until either the data for        that bearer or the UL grant is exhausted, whichever comes first.

At 601, the method includes the network (NW) configuring each DRB or LCGor bearer queue with the priority, the PBR, the BSD and other associatedparameters. At 602, the method includes sending/assigning the resourceto the UE (200), where the UE (200) sends the transport block usingscheduling to inform the MCS, no of resource blocks through which the UE(200) determines size of the transport block. At 603-604, the methodincludes allocating the received resource to one of the DRB, the logicalchannel, the LCG, and the DRB buffer, where the resource is allocated inthe decreasing priority order up to corresponding the PBR and theresource is allocated based on the PDCP distribution.

At 605, the method includes determining whether the PDCP distribution isthe sequential distribution or the batch distribution. At 606, themethod includes selecting data PDU from each logical channel until thePBR limit is reached in response to determining that the PDCPdistribution is the sequential distribution. At 607, the method includesselecting data PDU in batches from each logical channel until the PBRlimit is reached in response to determining that the PDCP distributionis nor the sequential distribution. At 608, the method includesdetecting whether the data PDU is pending in the logical channel At 609,the method includes detecting whether the detected data PDU in a strictdecreasing priority order in response to determining that the data PDUis pending in the logical channel. At 610, the method includesallocating pending resources to all the DRB or LCG or bearer queue untileither the data PDU for that DRB or the UL grant is exhausted for thatDRB.

The various actions, acts, blocks, steps, or the like in the flowdiagram (600) may be performed in the order presented, in a differentorder or simultaneously. Further, in some embodiments, some of theactions, acts, blocks, steps, or the like may be omitted, added,modified, skipped, or the like without departing from the scope of thedisclosure.

FIG. 7 is a diagram illustrating an example of a method for allocatingresource(s) in the 6G networks and beyond, according to variousembodiments.

Each DRB can be configured with priority, bearer PBR, BSD, and otherassociated parameters required to form MAC SDU. The UE (200) allocatesresources to the bearers in the following steps:

-   -   a. Step A: All the bearers are allocated resources in a        decreasing priority order up to their PBR, as indicated by the        numbers (1, 2, and 3).    -   b. Step B: Resources have been allocated to multiple logical        channels under the same bearer—handling of multiple logical        channels under the same bearer, as indicated by the numbers (4,        5, and 6). The selection of a logical channel for the allocation        of resources depends upon the distribution scheme at PDCP and/or        PBR value (if configured). In the example distribution scheme is        considered as sequential or batch and PBR is set as equal    -   c. Step C: if any resources remain, all the bearers are served        in strict decreasing priority order until either the data for        that bearer or the UL grant is exhausted, whichever comes first,        as indicated by the numbers (7, 8).

The embodiments disclosed herein can be implemented using at least onehardware device and performing network management functions to controlthe elements.

The foregoing description of the various example embodiments will revealthe general nature of the embodiments herein so that others can, byapplying current knowledge, readily modify and/or adapt for variousapplications such specific embodiments without departing from thegeneric concept, and, therefore, such adaptations and modificationsshould and are intended to be comprehended within the meaning and rangeof equivalents of the disclosed embodiments. It is to be understood thatthe phraseology or terminology employed herein is for the purpose ofdescription and not of limitation. Therefore, while the disclosure hasbeen illustrated and described with reference to various exampleembodiments, it will be understood that the various example embodimentsare intended to be illustrative, not limiting. It will be furtherunderstood, by those skilled in the art that various changes in form anddetail may be made without departing from the true spirit and full scopeof the disclosure, including the appended claims and their equivalents.

What is claimed is:
 1. A method performed by a network entity in awireless network, the method comprising: receiving, by the networkentity, a plurality of data packets belonging to at least one Data RadioBearer (DRB) to be prioritized from a network to a User Equipment (UE)using a plurality of logical channels; configuring, by the networkentity, at least one Quality of Service (QoS) parameter, wherein the atleast one QoS parameter comprises a priority, a Prioritized Bit Rate(PBR), and a Bucket Size Duration (BSD); allocating, by the networkentity, the at least one configured QoS parameter to one of a DRB, alogical channel, a Logical Channel Group (LCG), and a DRB buffer orqueue; dividing, by the network entity, the at least one QoS parameteracross the one of the DRB, the logical channel, the LCG, and the DRBbuffer or queue; and sending, by the network entity, the plurality ofdata packets to the UE by allocating at least one resource based on thePBR and the BSD.
 2. The method as claimed in claim 1, wherein the atleast one QoS parameter is configured by: performing, by the networkentity, one of: configuring the PBR and the BSD based on the DRB;configuring the PBR and the BSD based on the LCG; configuring the PBRand the BSD based on the DRB buffer or queue; or configuring the PBR andthe BSD based on the logical channel.
 3. The method as claimed in claim2, wherein the configuring the PBR and the BSD based on the DRBcomprises: detecting, by the network entity the at least one DRB with atleast one logic channel; and configuring, by the network entity, a valueof the PBR, the BSD, and the at least one UE parameter for each DRB,wherein each DRB comprises the plurality of logical channels.
 4. Themethod as claimed in claim 2, wherein the configuring the PBR and theBSD based on the LCG comprises: detecting, by the network entity the atleast one DRB having multiple logical channel, wherein the multiplelogic channel belongs to a single LCG; and configuring, by the networkentity, a value of the PBR, the BSD, and the at least one UE parameterfor each LCG, wherein each LCG comprises the plurality of logicalchannels, wherein each LCG comprises a unique Identity (ID).
 5. Themethod as claimed in claim 2, wherein the configuring the PBR and theBSD based on the DRB buffer or queue comprises: configuring, by thenetwork entity, a value of the PBR, the BSD, and the at least one UEparameter for each DRB buffer or queue, wherein each medium accesscontrol (MAC) entity of the network entity maintains the DRB buffer orqueue and stores data of the DRB buffer or queue from different logicalchannel under same DRB bearer or IP flow.
 6. The method as claimed inclaim 5, wherein allocating of resources for data transmission may runon the DRB buffer or queue and size of the DRB buffer or queue dependson a transmitting window of radio link control (RLC), and is based onthe PBR and the BSD.
 7. The method as claimed in claim 2, wherein theconfiguring the PBR and the BSD based on the logical channel comprises:detecting, by the network entity, multiple logic channel under a sameDRB; and configuring, by the network entity, a value of the PBR, theBSD, and the at least one UE parameter for each logical channel of theplurality of logical channels.
 8. The method as claimed in claim 1,wherein the at least one QoS parameter is configured through at leastone of a Radio Resource Control (RRC) message and a layer-2 message. 9.The method as claimed in claim 1, wherein allocating, by the networkentity, the at least one configured QoS parameter to the one of the DRB,the logical channel, the LCG, and the DRB buffer or queue comprises:distributing, by the network entity or the UE, the value of the PBR andthe BSD among multiple logic channels based on a packet data convergenceprotocol (PDCP) distribution, wherein the network entity is configuredthe PDCP distribution in a Radio Resource Control (RRC) message.
 10. Themethod as claimed in claim 9, wherein the PDCP distribution comprises asequential distribution or a random distribution, a block distributionor a batch distribution, and an uplink split threshold-baseddistribution.
 11. The method as claimed in claim 10, wherein thesequential distribution or the random distribution comprises: assigning,by the network entity, at least one PDCP-Protocol Data Unit (PDU) to atleast one sub-flow of a Radio link control (RLC) in a round-robinmanner; and mapping, by the network entity, the at least one PDCP-PDU tothe at least one sub-flow of the RLC.
 12. The method as claimed in claim10, wherein the block distribution or the batch distribution comprisesat least one of: mapping, by at least one of the network entity and theUE, a batch of sequential PDCP-PDUs to at least one sub-flow of the RLC;mapping, by the at least one of the network entity and the UE, thePDCP-PDUs with least buffer occupancy; mapping, by the network entity,the PDCP-PDUs based on a processing capability of the UE; and mapping,by the at least one of the network entity and the UE, the PDCP-PDUsbased on a number of transmissions of the plurality of data packets. 13.The method as claimed in claim 9, wherein distributing, by the networkentity or the UE, the value of the PBR and the BSD among multiple logicchannels based on the PDCP distribution comprises: determining, by thenetwork entity, whether the PDCP distribution is the sequentialdistribution or the block distribution; and performing, by the networkentity, one of: equally distributing the value of the PBR to eachlogical channel of the plurality of logical channels in response todetermining that the PDCP distribution is the sequential distribution orthe block distribution; and distributing the value of the PBR to eachlogical channel of the plurality of logical channels based on the uplinksplit threshold value in response to determining that the PDCPdistribution is not the sequential distribution or the blockdistribution, wherein the uplink split threshold configured by thenetwork entity or based on the capability of the UE.
 14. The method asclaimed in claim 13, wherein distributing the value of the PBR to eachlogical channel of the plurality of logical channels based on the uplinksplit threshold value comprises: configuring, by the network entity, theuplink split threshold; determining, by the network entity, whether dataavailable for transmission is larger than or equal to the uplink splitthreshold; and performing, by the network entity, one of: mappingPDCP-PDUs to a primary logical channel of the plurality of logicalchannels in response to determining that the data available fortransmission is larger than or equal to the uplink split threshold; andmapping PDCP-PDUs to at least one-second logical channel of theplurality of logical channels in response to determining that the dataavailable for transmission is not larger than or equal to the uplinksplit threshold.
 15. The method as claimed in claim 1, the methodcomprises: sending, by the network entity, the at least one resource tothe UE, wherein the UE sends a transport block using scheduling toinform a Modulation and Coding Scheme (MCS), no of resource blocksthrough which the UE determines size of the transport block.
 16. Amethod performed by a user equipment (UE) in a wireless network, themethod comprising: receiving, by the UE, the at least one resource fromthe network entity; allocating, by the UE, the at least one receivedresource to the at least one of a Data Radio Bearer (DRB), the logicalchannel, a Logical Channel Group (LCG), and a DRB buffer, wherein the atleast one resource is allocated in decreasing priority order up tocorresponding a Prioritized Bit Rate (PBR) and the at least one resourceis allocated based on a packet data convergence protocol (PDCP)distribution; determining, by the UE, whether the PDCP distribution isthe sequential distribution; performing, by the UE, one of: selectingdata protocol data unit (PDU) from each logical channel until the PBRlimit is reached in response to determining that the PDCP distributionis the sequential distribution; and selecting data PDU in batches fromeach logical channel until the PBR limit is reached in response todetermining that the PDCP distribution is nor the sequentialdistribution; detecting, by the UE, that the data PDU is pending in atleast one logical channel; detecting, by the UE, that the detected dataPDU in a strict decreasing priority order; and allocating, by the UE,pending resources to all the DRB or LCG or bearer queue until either thedata PDU for that DRB or a UL grant is exhausted for that DRB.
 17. Anetwork entity in a wireless network, the network entity comprising: amemory; a processor; and a logical channel controller, operablyconnected to the memory and the processor, configured to: receive aplurality of data packets to be prioritized belonging to at least oneData Radio Bearer (DRB) from a network to a User Equipment (UE) using aplurality of logical channels; configure at least one Quality of Service(QoS) parameter, wherein the at least one QoS parameter comprises apriority, a Prioritized Bit Rate (PBR), and a Bucket Size Duration(BSD); allocate the at least one configured QoS parameter to one of aDRB, a logical channel, a Logical Channel Group (LCG), and a DRB bufferor queue; divide the at least one QoS parameter across the one of theDRB, the logical channel, the LCG, and the DRB buffer or queue; and sendthe plurality of data packets to the UE by allocating at least oneresource as per the PBR and the BSD.
 18. A User Equipment (UE) in awireless network, the UE comprising: a memory; a processor; and alogical channel controller, operably connected to the memory and theprocessor, configured to: receive, by the UE, the at least one resourcefrom the network entity; allocate, by the UE, the at least one receivedresource to the at least one of a Data Radio Bearer (DRB), a logicalchannel, a Logical Channel Group (LCG), and a DRB buffer, wherein the atleast one resource is allocated in decreasing priority order up tocorresponding a Prioritized Bit Rate (PBR) and the at least one resourceis allocated based on a packet data convergence protocol (PDCP)distribution; determine, by the UE, whether the PDCP distribution is thesequential distribution; perform, by the UE, one of: selecting data PDUfrom each logical channel until the PBR limit is reached in response todetermining that the PDCP distribution is the sequential distribution;and selecting data PDU in batches from each logical channel until thePBR limit is reached in response to determining that the PDCPdistribution is nor the sequential distribution; detect, by the UE, thatthe data PDU is pending in at least one logical channel; detect, by theUE, that the detected data PDU in a strict decreasing priority order;and allocate, by the UE, pending resources to all the DRB or LCG orbearer queue until either the data PDU for that DRB or a UL grant isexhausted for that DRB.